An Algorithm for Retrieving Skyline Points based on User Specified Constraints using the Skyline Ordering

نویسندگان

  • Jasna S
  • Manu J Pillai
  • J. L. Bentley
  • H. T. Kung
  • M. Schkolnick
  • C. D. Thompson
  • J. R. Smith
چکیده

Given a multidimensional data set, a skyline query returns the interesting points that are not dominated by other points. The actual cardinality (s) of a skyline query result may vary substantially from the desired result cardinality (k). An approach called skyline ordering is used that forms a skyline based partitioning of a given data set, it provides an ordering among the partitions. The constrained skyline query results the skyline points that may be too small in some cases. The paper proposes a new method for finding the arbitrary number of points for the constrained skyline query. The skyline ordering algorithm and size constrained skyline ordering algorithm are used for developing the algorithm. The results of experiments of algorithm show that the proposed scheme yields an efficient and scalable resolution of arbitrary size constraints on constrained skyline queries. By comparing the existing and proposed system, the proposed system is efficient in returning the arbitrary number of skyline points.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skyline Ordering: A Flexible Framework for Efficient Resolution of Size Constraints on Skyline Queries

Given a set of multi-dimensional points, a skyline query returns the interesting points that are not dominated by other points. It has been observed that the actual cardinality (s) of a skyline query result may differ substantially from the desired result cardinality (k), which has prompted studies on how to reduce s for the case where k < s. This paper goes further by addressing the general ca...

متن کامل

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

Skyline Ranking à la IR

Skyline queries have emerged as an expressive and informative tool, with minimal user input and thus, they have gained widespread attention. However, previous research works tackle the problem from an efficiency standpoint, i.e., returning the skyline as fast as possible, leaving it to the user to manually inspect the entire skyline result. Clearly, this is impractical, even with a few dozen po...

متن کامل

Explanations for Skyline Query Results

Skyline queries are a well-studied problem for multidimensional data, wherein points are returned to the user iff no other point is preferable across all attributes. This leaves only the points most likely to appeal to an arbitrary user. However, some dominated points may still be interesting, and the skyline offers little support for helping the user understand why some interesting points are ...

متن کامل

Link-based Ranking of Skyline Result Sets

Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multi-dimensional dataset. One of the major drawbacks of the skyline operator is the high cardinality of the result set. Providing the most interesting points of the skyline set (top-k) inherently involves the ranking of the skyline p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014